PolyBoRi: A framework for Gröbner-basis computations with Boolean polynomials
نویسندگان
چکیده
منابع مشابه
PolyBoRi: A framework for Gröbner-basis computations with Boolean polynomials
This work presents a new framework for Gröbner basis computations with Boolean polynomials. Boolean polynomials can be modelled in a rather simple way, with both coefficients and degree per variable lying in {0, 1}. The ring of Boolean polynomials is, however, not a polynomial ring, but rather the quotient ring of the polynomial ring over the field with two elements modulo the field equations x...
متن کاملPOLYBORI: A Gröbner Basis Framework for Boolean Polynomials
This work presents a new framework for Gröbner basis computations with Boolean polynomials. Boolean polynomials can be modeled in a rather simple way, with both coefficients and degree per variable lying in {0, 1}. The ring of Boolean polynomials is, however, not a polynomial ring, but rather the quotient ring of the polynomial ring over the field with two elements modulo the field equations x2...
متن کاملFast Gröbner Basis Computation for Boolean Polynomials
We introduce the Macaulay2 package BooleanGB, which computes a Gröbner basis for Boolean polynomials using a binary representation rather than symbolic. We compare the runtime of several Boolean models from systems in biology and give an application to Sudoku.
متن کاملThe Gröbner basis of the ideal of vanishing polynomials
We construct an explicit minimal strong Gröbner basis of the ideal of vanishing polynomials in the polynomial ring over Z/m for m ≥ 2. The proof is done in a purely combinatorial way. It is a remarkable fact that the constructed Gröbner basis is independent of the monomial order and that the set of leading terms of the constructed Gröbner basis is unique, up to multiplication by units. We also ...
متن کاملGröbner Bases for Linearized Polynomials
In this work we develop the theory of Gröbner bases for modules over the ring of univariate linearized polynomials with coefficients from a finite field.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2009
ISSN: 0747-7171
DOI: 10.1016/j.jsc.2008.02.017